Distributed Average Consensus With Dithered Quantization
نویسندگان
چکیده
منابع مشابه
Rates of Convergence for Distributed Average Consensus with Probabilistic Quantization
Probabilistically quantized distributed averaging (PQDA) is a fully decentralized algorithm for performing average consensus in a network with finite-rate links. At each iteration, nodes exchange quantized messages with their immediate neighbors. Then each node locally computes a weighted average of the messages it received, quantizes this new value using a randomized quantization scheme, and t...
متن کاملEfficient quantization for average consensus
This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme.
متن کاملDithered Color Quantization
Image quantization and digital halftoning are fundamental problems in computer graphics, which arise when displaying high-color images on non-truecolor devices. Both steps are generally performed sequentially and, in most cases, independent of each other. Color quantization with a pixel-wise defined distortion measure and the dithering process with its local neighborhood optimize different qual...
متن کاملSource Coding Optimization for Distributed Average Consensus
PILGRIM, RYAN ZACHARY. Source Coding Optimization for Distributed Average Consensus. (Under the direction of Dror Baron.) Consensus is a common method for computing a function of the data distributed among the nodes of a network. Of particular interest is distributed average consensus, whereby the nodes iteratively compute the sample average of the data stored at all the nodes of the network us...
متن کاملDistributed Stopping for Average Consensus in Digraphs
We consider how iterative strategies for asymptotic average consensus in directed graphs (digraphs) can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate the execution of the iteration when approximate average consensus has been reached. The nodes are said to have reached approximate average consensus when each of them has a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2008
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2008.927071